An Efficient Data-Independent Priority Queue and its Application to Dark Pools

We introduce a secure data-independent priority queue which supports polylogarithmic-time insertion operations and constant-time deletions read-front (aka peek) as opposed to the originally introduced by Toft (PODC '11). Moreover, we minimize number of comparisons required perform different on Toft's queue. Data-independent data structures—first identified explicitly Toft, further elaborated Mitchell Zimmerman (STACS '14)—serve purpose computing encrypted without executing branching code can be used avoid prohibitively expensive in computation applications. Focusing costly sorting operations, show significant asymptotic improvements over prior privacy preserving dark pool Dark pools are securities-trading venues attain ad-hoc order privacy, matching orders outside publicly visible exchanges via so-called operators. In this paper, describe an efficient (implementing full continuous double auction) based our new Our construction's security guarantees cryptographic multiparty (MPC), do not require that operators trusted. construction improves upon efficiency attained previous efforts. Existing process time grows linearly size standing book; ours does so polylogarithmic time. concrete implementation MPC protocol with malicious honest majority setting. also report benchmarks compare them works. reduces total running several magnitude solutions.